A Survey of Geodetic Approaches to Mapping and the Relationship to Graph-Based SLAM
نویسندگان
چکیده
The ability to simultaneously localize a robot and build a map of the environment is central to most robotic applications and the problem is often referred to as SLAM. Robotics researchers have proposed a large variety of solutions allowing robots to build maps and use them for navigation. Also the geodetic community addressed large-scale map building for centuries, computing maps which span across continents. These large-scale mapping processes had to deal with several challenges that are similar to those of the robotics community. In this paper, we explain key geodetic map building methods that we believe are relevant for robot mapping. We also aim at providing a geodetic perspective on current state-of-the-art SLAM methods and identifying similarities both in terms of challenges faced as well as in the solutions proposed by both communities. The central goal of this paper is to connect both fields and to enable future synergies between them.
منابع مشابه
Effects of Moving Landmark’s Speed on Multi-Robot Simultaneous Localization and Mapping in Dynamic Environments
Even when simultaneous localization and mapping (SLAM) solutions have been broadly developed, the vast majority of them relate to a single robot performing measurements in static environments. Researches show that the performance of SLAM algorithms deteriorates under dynamic environments. In this paper, a multi-robot simultaneous localization and mapping (MR-SLAM) system is implemented within a...
متن کاملMap-merging in Multi-robot Simultaneous Localization and Mapping Process Using Two Heterogeneous Ground Robots
In this article, a fast and reliable map-merging algorithm is proposed to produce a global two dimensional map of an indoor environment in a multi-robot simultaneous localization and mapping (SLAM) process. In SLAM process, to find its way in this environment, a robot should be able to determine its position relative to a map formed from its observations. To solve this complex problem, simultan...
متن کاملDistinct edge geodetic decomposition in graphs
Let G=(V,E) be a simple connected graph of order p and size q. A decomposition of a graph G is a collection π of edge-disjoint subgraphs G_1,G_2,…,G_n of G such that every edge of G belongs to exactly one G_i,(1≤i ≤n). The decomposition 〖π={G〗_1,G_2,…,G_n} of a connected graph G is said to be a distinct edge geodetic decomposition if g_1 (G_i )≠g_1 (G_j ),(1≤i≠j≤n). The maximum cardinality of π...
متن کاملNew Adaptive UKF Algorithm to Improve the Accuracy of SLAM
SLAM (Simultaneous Localization and Mapping) is a fundamental problem when an autonomous mobile robot explores an unknown environment by constructing/updating the environment map and localizing itself in this built map. The all-important problem of SLAM is revisited in this paper and a solution based on Adaptive Unscented Kalman Filter (AUKF) is presented. We will explain the detailed algorithm...
متن کاملOn the edge geodetic and edge geodetic domination numbers of a graph
In this paper, we study both concepts of geodetic dominatingand edge geodetic dominating sets and derive some tight upper bounds onthe edge geodetic and the edge geodetic domination numbers. We also obtainattainable upper bounds on the maximum number of elements in a partitionof a vertex set of a connected graph into geodetic sets, edge geodetic sets,geodetic domin...
متن کامل